A B-rep Data Structure for Polygonal Meshes
نویسندگان
چکیده
This paper introduces a new b-rep (boundary representation) data structure, called AIF (Adjacency and Incidence Framework). It is concise and enables fast access to topological information. Its conciseness results from the fact that it is an orientable, but not an oriented, data structure, i.e. an orientation can be topologically induced as necessary in many applications. It is an optimal 9 4 C data structure for polygonal meshes, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. Besides, the AIF data structure may accommodate general polygonal meshes, regardless of whether or not they are triangular and manifold.
منابع مشابه
Progressive Combined B-Reps - Multi-Resolution Meshes for Interactive Real-Time Shape Design
We present the Combined B-rep (cB-rep) as a multiresolution data structure suitable for interactive modeling and visualization of models composed of both free-form and polygonal parts. It is based on a half-edge data structure combined with Catmull/Clark subdivision surfaces. In addition to displaying the curved parts of the surface at an adaptive level-of-detail, the control mesh itself can be...
متن کاملBlending Operations Using Rolling-Ball Filleting
Blending sharp edges in solid models is an important task of Computeraided design. The prominent algorithms for producing blending fillet surfaces relay mostly on the rolling-ball method. These algorithms are applied on B-Rep solid models that are used in many CAD/CAM systems. Such solid models allow for a hierarchical approach of modeling which can incorporate blending operations within its st...
متن کاملHybrid Coding for Animated Polygonal Meshes
A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied...
متن کاملGeneralizing lifted tensor-product wavelets to irregular polygonal domains
Approximation, B-Splines, Geometry Compression, Lifting, Subdivision Surfaces, Tessellations, Wavelets We present a new construction approach for symmetric lifted B-spline wavelets on irregular polygonal control meshes defining two-manifold topologies. Polygonal control meshes are recursively refined by stationary subdivision rules and converge to piecewise polynomial limit surfaces. At every s...
متن کاملA Generic Halfedge Mesh Data Structure for .Net
Polygonal meshes are used extensively in computer graphics. A polygonal mesh represents a shape, usually in 3D, by using a set of points, the vertices, connected by edges. Edges form the boundaries of faces. A mesh is convenient to work with because it explicitly represents the surface that one is working with—vertices, edges, and faces are discreetly enumerated and may be manipulated directly....
متن کامل